0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.12	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.12/0.33	% Computer : n001.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1920
0.12/0.33	% WCLimit    : 240
0.12/0.33	% DateTime   : Wed Jul 30 02:35:04 EDT 2025
0.12/0.33	% CPUTime    : 
0.20/0.48	Running higher-order theorem proving
0.20/0.49	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.lclgGsaIJ5/E---3.1_9197.p
0.20/0.51	# Version: 3.0.0-ho
0.20/0.51	# Preprocessing class: HSSSSMSSSSMNHHA.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.51	# Starting post_as_ho5 with 1200s (5) cores
0.20/0.51	# Starting sh2lt with 240s (1) cores
0.20/0.51	# Starting ehoh_best8_lambda with 240s (1) cores
0.20/0.51	# Starting post_as_ho10 with 240s (1) cores
0.20/0.51	# post_as_ho5 with pid 9275 completed with status 0
0.20/0.51	# Result found by post_as_ho5
0.20/0.51	# Preprocessing class: HSSSSMSSSSMNHHA.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.51	# Starting post_as_ho5 with 1200s (5) cores
0.20/0.51	# SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
0.20/0.51	# Search class: HGUNF-FFSF11-MHHFFMBN
0.20/0.51	# partial match(1): HGUNF-FFSF11-SHHFFMBN
0.20/0.51	# Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total)
0.20/0.51	# Starting ho_unfolding_3 with 649s (1) cores
0.20/0.51	# Starting post_as_ho5 with 121s (1) cores
0.20/0.51	# Starting sh5l with 109s (1) cores
0.20/0.51	# Starting new_bool_3 with 109s (1) cores
0.20/0.51	# Starting new_bool_1 with 109s (1) cores
0.20/0.51	# post_as_ho5 with pid 9280 completed with status 0
0.20/0.51	# Result found by post_as_ho5
0.20/0.51	# Preprocessing class: HSSSSMSSSSMNHHA.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.51	# Starting post_as_ho5 with 1200s (5) cores
0.20/0.51	# SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
0.20/0.51	# Search class: HGUNF-FFSF11-MHHFFMBN
0.20/0.51	# partial match(1): HGUNF-FFSF11-SHHFFMBN
0.20/0.51	# Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total)
0.20/0.51	# Starting ho_unfolding_3 with 649s (1) cores
0.20/0.51	# Starting post_as_ho5 with 121s (1) cores
0.20/0.51	# Preprocessing time       : 0.001 s
0.20/0.51	# Presaturation interreduction done
0.20/0.51	
0.20/0.51	# Proof found!
0.20/0.51	# SZS status Theorem
0.20/0.51	# SZS output start CNFRefutation
0.20/0.51	thf(decl_sort1, type, a: $tType).
0.20/0.51	thf(decl_23, type, esk1_0: a > a).
0.20/0.51	thf(decl_24, type, esk2_0: a > a).
0.20/0.51	thf(decl_25, type, esk3_0: a > a).
0.20/0.51	thf(decl_26, type, esk4_1: ((a > a) > $o) > a > a).
0.20/0.51	thf(decl_27, type, esk5_1: ((a > a) > $o) > a > a).
0.20/0.51	thf(decl_28, type, epred1_0: (a > a) > $o).
0.20/0.51	thf(cTHM135_pme, conjecture, ![X1:a > a, X2:a > a, X3:a > a]:(((![X4:(a > a) > $o]:(((X4 @ X2)<=((X4 @ (^[X5:a]:(X5)))&![X6:a > a]:(((X4 @ X6)=>(X4 @ (^[X7:a]:(X1 @ (X6 @ X7)))))))))&![X4:(a > a) > $o]:(((X4 @ X3)<=(![X6:a > a]:(((X4 @ X6)=>(X4 @ (^[X7:a]:(X1 @ (X6 @ X7))))))&(X4 @ (^[X5:a]:(X5)))))))=>![X4:(a > a) > $o]:((((X4 @ (^[X5:a]:(X5)))&![X6:a > a]:(((X4 @ (^[X7:a]:(X1 @ (X6 @ X7))))<=(X4 @ X6))))=>(X4 @ (^[X7:a]:(X2 @ (X3 @ X7)))))))), file('/export/starexec/sandbox2/tmp/tmp.lclgGsaIJ5/E---3.1_9197.p', cTHM135_pme)).
0.20/0.51	thf(c_0_1, negated_conjecture, ~(![X1:a > a, X2:a > a, X3:a > a]:(((![X4:(a > a) > $o]:((((X4 @ (^[Z0/* 0 */:a]:(Z0)))&![X6:a > a]:(((X4 @ X6)=>(X4 @ (^[Z0/* 17 */:a]:(X1 @ (X6 @ Z0)))))))=>(X4 @ X2)))&![X4:(a > a) > $o]:(((![X6:a > a]:(((X4 @ X6)=>(X4 @ (^[Z0/* 17 */:a]:(X1 @ (X6 @ Z0))))))&(X4 @ (^[Z0/* 0 */:a]:(Z0))))=>(X4 @ X3))))=>![X4:(a > a) > $o]:((((X4 @ (^[Z0/* 0 */:a]:(Z0)))&![X6:a > a]:(((X4 @ X6)=>(X4 @ (^[Z0/* 17 */:a]:(X1 @ (X6 @ Z0)))))))=>(X4 @ (^[Z0/* 17 */:a]:(X2 @ (X3 @ Z0))))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM135_pme])])])).
0.20/0.51	thf(c_0_2, negated_conjecture, ![X20:(a > a) > $o, X22:(a > a) > $o, X25:a > a]:((((((X20 @ (esk4_1 @ X20))|~(X20 @ (^[Z0/* 0 */:a]:(Z0)))|(X20 @ esk2_0))&(~(X20 @ (^[Z0/* 23 */:a]:(esk1_0 @ (esk4_1 @ X20 @ Z0))))|~(X20 @ (^[Z0/* 0 */:a]:(Z0)))|(X20 @ esk2_0)))&(((X22 @ (esk5_1 @ X22))|~(X22 @ (^[Z0/* 0 */:a]:(Z0)))|(X22 @ esk3_0))&(~(X22 @ (^[Z0/* 23 */:a]:(esk1_0 @ (esk5_1 @ X22 @ Z0))))|~(X22 @ (^[Z0/* 0 */:a]:(Z0)))|(X22 @ esk3_0))))&(((epred1_0 @ (^[Z0/* 0 */:a]:(Z0)))&(~(epred1_0 @ X25)|(epred1_0 @ (^[Z0/* 23 */:a]:(esk1_0 @ (X25 @ Z0))))))&~(epred1_0 @ (^[Z0/* 24 */:a]:(esk2_0 @ (esk3_0 @ Z0))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
0.20/0.51	thf(c_0_3, negated_conjecture, ![X4:(a > a) > $o]:(((X4 @ (esk5_1 @ X4))|(X4 @ esk3_0)|~((X4 @ (^[Z0/* 0 */:a]:(Z0)))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_4, negated_conjecture, (epred1_0 @ (^[Z0/* 0 */:a]:(Z0))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_5, negated_conjecture, ![X1:a > a]:(((epred1_0 @ (^[Z0/* 23 */:a]:(esk1_0 @ (X1 @ Z0))))|~((epred1_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_6, negated_conjecture, ((epred1_0 @ (esk5_1 @ epred1_0))|(epred1_0 @ esk3_0)), inference(spm,[status(thm)],[c_0_3, c_0_4])).
0.20/0.51	thf(c_0_7, negated_conjecture, ![X4:(a > a) > $o]:(((X4 @ esk3_0)|~((X4 @ (^[Z0/* 23 */:a]:(esk1_0 @ (esk5_1 @ X4 @ Z0)))))|~((X4 @ (^[Z0/* 0 */:a]:(Z0)))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_8, negated_conjecture, ((epred1_0 @ (^[Z0/* 23 */:a]:(esk1_0 @ (esk5_1 @ epred1_0 @ Z0))))|(epred1_0 @ esk3_0)), inference(spm,[status(thm)],[c_0_5, c_0_6])).
0.20/0.51	thf(c_0_9, negated_conjecture, ![X4:(a > a) > $o]:(((X4 @ (esk4_1 @ X4))|(X4 @ esk2_0)|~((X4 @ (^[Z0/* 0 */:a]:(Z0)))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_10, negated_conjecture, (epred1_0 @ esk3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_4])])).
0.20/0.51	thf(c_0_11, negated_conjecture, ~((epred1_0 @ (^[Z0/* 24 */:a]:(esk2_0 @ (esk3_0 @ Z0))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_12, negated_conjecture, (epred1_0 @ (^[Z0/* 26 */:a]:(esk4_1 @ (^[Z1/* 3 */:a > a]:((epred1_0 @ (^[Z2/* 17 */:a]:(Z1 @ (esk3_0 @ Z2)))))) @ (esk3_0 @ Z0)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11])).
0.20/0.51	thf(c_0_13, negated_conjecture, ![X4:(a > a) > $o]:(((X4 @ esk2_0)|~((X4 @ (^[Z0/* 23 */:a]:(esk1_0 @ (esk4_1 @ X4 @ Z0)))))|~((X4 @ (^[Z0/* 0 */:a]:(Z0)))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_14, negated_conjecture, (epred1_0 @ (^[Z0/* 23 */:a]:(esk1_0 @ (esk4_1 @ (^[Z1/* 3 */:a > a]:((epred1_0 @ (^[Z2/* 17 */:a]:(Z1 @ (esk3_0 @ Z2)))))) @ (esk3_0 @ Z0))))), inference(spm,[status(thm)],[c_0_5, c_0_12])).
0.20/0.51	thf(c_0_15, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_10])]), c_0_11]), ['proof']).
0.20/0.51	# SZS output end CNFRefutation
0.20/0.51	# Parsed axioms                        : 2
0.20/0.51	# Removed by relevancy pruning/SinE    : 1
0.20/0.51	# Initial clauses                      : 7
0.20/0.51	# Removed in clause preprocessing      : 0
0.20/0.51	# Initial clauses in saturation        : 7
0.20/0.51	# Processed clauses                    : 69
0.20/0.51	# ...of these trivial                  : 0
0.20/0.51	# ...subsumed                          : 0
0.20/0.51	# ...remaining for further processing  : 69
0.20/0.51	# Other redundant clauses eliminated   : 0
0.20/0.51	# Clauses deleted for lack of memory   : 0
0.20/0.51	# Backward-subsumed                    : 0
0.20/0.51	# Backward-rewritten                   : 13
0.20/0.51	# Generated clauses                    : 133
0.20/0.51	# ...of the previous two non-redundant : 97
0.20/0.51	# ...aggressively subsumed             : 0
0.20/0.51	# Contextual simplify-reflections      : 0
0.20/0.51	# Paramodulations                      : 94
0.20/0.51	# Factorizations                       : 0
0.20/0.51	# NegExts                              : 11
0.20/0.51	# Equation resolutions                 : 4
0.20/0.51	# Disequality decompositions           : 0
0.20/0.51	# Total rewrite steps                  : 61
0.20/0.51	# ...of those cached                   : 54
0.20/0.51	# Propositional unsat checks           : 0
0.20/0.51	#    Propositional check models        : 0
0.20/0.51	#    Propositional check unsatisfiable : 0
0.20/0.51	#    Propositional clauses             : 0
0.20/0.51	#    Propositional clauses after purity: 0
0.20/0.51	#    Propositional unsat core size     : 0
0.20/0.51	#    Propositional preprocessing time  : 0.000
0.20/0.51	#    Propositional encoding time       : 0.000
0.20/0.51	#    Propositional solver time         : 0.000
0.20/0.51	#    Success case prop preproc time    : 0.000
0.20/0.51	#    Success case prop encoding time   : 0.000
0.20/0.51	#    Success case prop solver time     : 0.000
0.20/0.51	# Current number of processed clauses  : 48
0.20/0.51	#    Positive orientable unit clauses  : 22
0.20/0.51	#    Positive unorientable unit clauses: 0
0.20/0.51	#    Negative unit clauses             : 5
0.20/0.51	#    Non-unit-clauses                  : 21
0.20/0.51	# Current number of unprocessed clauses: 40
0.20/0.51	# ...number of literals in the above   : 78
0.20/0.51	# Current number of archived formulas  : 0
0.20/0.51	# Current number of archived clauses   : 21
0.20/0.51	# Clause-clause subsumption calls (NU) : 54
0.20/0.51	# Rec. Clause-clause subsumption calls : 49
0.20/0.51	# Non-unit clause-clause subsumptions  : 0
0.20/0.51	# Unit Clause-clause subsumption calls : 4
0.20/0.51	# Rewrite failures with RHS unbound    : 0
0.20/0.51	# BW rewrite match attempts            : 107
0.20/0.51	# BW rewrite match successes           : 2
0.20/0.51	# Condensation attempts                : 0
0.20/0.51	# Condensation successes               : 0
0.20/0.51	# Termbank termtop insertions          : 12231
0.20/0.51	# Search garbage collected termcells   : 337
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.010 s
0.20/0.51	# System time              : 0.007 s
0.20/0.51	# Total time               : 0.018 s
0.20/0.51	# Maximum resident set size: 1896 pages
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.064 s
0.20/0.51	# System time              : 0.016 s
0.20/0.51	# Total time               : 0.079 s
0.20/0.51	# Maximum resident set size: 1744 pages
0.20/0.51	% E exiting
0.20/0.52	% E exiting
0.20/0.52	EOF